A simple and elementary proof of Whitney's unique embedding theorem

In this note we give a short and elementary proof of more general version Whitney’s theorem that 3-connected planar graphs have unique embedding in the plane. A consequence is also cubic plane cannot be embedded higher genus with simple dual. The aim paper to promote proof, which especially well suited for lectures presenting theorem.